Interlacing families III: Sharper restricted invertibility estimates

نویسندگان

چکیده

We use the method of interlacing families polynomials to derive a simple proof Bourgain and Tzafriri’s Restricted Invertibility Principle, then sharpen result in two ways. show that stable rank can be replaced by Schatten 4-norm tighter bounds hold when number columns matrix under consideration does not greatly exceed its rows. Our are derived from an analysis smallest zeros Jacobi associated Laguerre polynomials.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted Invertibility Revisited

Suppose that m,n ∈ N and that A : R → R is a linear operator. It is shown here that if k, r ∈ N satisfy k < r 6 rank(A) then there exists a subset σ ⊆ {1, . . . ,m} with |σ| = k such that the restriction of A to R ⊆ R is invertible, and moreover the operator norm of the inverse A−1 : A(R) → R is at most a constant multiple of the quantity √ mr/((r − k) ∑m i=r si(A) 2), where s1(A) > . . . > sm(...

متن کامل

Infinite Dimensional Restricted Invertibility

The 1987 Bourgain-Tzafriri Restricted Invertibility Theorem is one of the most celebrated theorems in analysis. At the time of their work, the authors raised the question of a possible infinite dimensional version of the theorem. In this paper, we will give a quite general definition of restricted invertibility for operators on infinite dimensional Hilbert spaces based on the notion of density ...

متن کامل

Spectral Sparsification and Restricted Invertibility

Spectral Sparsification and Restricted Invertibility Nikhil Srivastava 2010 In this thesis we prove the following two basic statements in linear algebra. Let B be an arbitrary n×m matrix where m ≥ n and suppose 0 < ε < 1 is given. 1. Spectral Sparsification. There is a nonnegative diagonal matrix Sm×m with at most dn/ε2e nonzero entries for which (1− ε)2BBT BSBT (1 + ε)2BBT . Thus the spectral ...

متن کامل

6.1 Interlacing Families of Polynomials

In this lecture we introduce the concept of interlacing for polynomials. This concept provide a convenient way of reasoning about orderings of the roots of real-rooted polynomials. Specifically, it provides a way of tying the roots of the average polynomial (obtained by averaging the coefficients) to the roots of the individual polynomials. This can for example —in the spirit of the probabilist...

متن کامل

Lecture Notes for Interlacing Families

In these notes we follow the two papers [6, 7] where Marcus, Spielman and Srivastava developed a method that they coined the method of interlacing families. In [6] they proved the existence of infinite families of bipartite Ramanujan graphs for all degrees, and in [7] they provided a positive answer to the notorious Kadison– Singer problem. We take the opportunity to have a slightly more genera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2021

ISSN: ['1565-8511', '0021-2172']

DOI: https://doi.org/10.1007/s11856-021-2277-z